When the extension property does not hold for vector space alphabets

نویسنده

  • Serhii Dyshko
چکیده

In our previous work [4] we showed that the extension property holds for linear codes over a finite module alphabet with respect to the symmetrized weight composition if and only if the socle of the alphabet is cyclic. For alphabets with a noncyclic socle we proved the existence of an unextendable isometry. However, our construction was implicit. This paper deals with a particular case of an alphabet with a noncyclic socle, a vector space alphabet. Here we give an explicit construction of a code with an unextendable isometry, see Section 3.1. Moreover, the code and the isometry have nice additional properties, see Proposition 4 and Proposition 5. Unlike the general case, where we do not know the length of the constructed code, for vector space alphabet we show that the length can be relatively small. For the symmetrized weight composition built on the trivial group we give the lover bound on the length of a code with an unextendable isometry, see Proposition 6. In [4] we also introduced the notion of G-pseudo-injectivity for finite modules. It is related to the extension property for codes of the length 1. We characterize this property in the context of vector spaces, see Proposition 2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

When the extension property does not hold

A complete extension theorem for linear codes over a module alphabet and the symmetrized weight composition is proved. It is shown that an extension property with respect to arbitrary weight function does not hold for module alphabets with a noncyclic socle.

متن کامل

Nonexpansive mappings on complex C*-algebras and their fixed points

A normed space $mathfrak{X}$ is said to have the fixed point property, if for each nonexpansive mapping $T : E longrightarrow E $ on a nonempty bounded closed convex subset $ E $ of $ mathfrak{X} $ has a fixed point. In this paper, we first show that if $ X $ is a locally compact Hausdorff space then the following are equivalent: (i) $X$ is infinite set, (ii) $C_0(X)$ is infinite dimensional, (...

متن کامل

Strong duality and sensitivity analysis in semi - infinite linear 1 programming

Finite-dimensional linear programs satisfy strong duality (SD) and have the “dual 8 pricing” (DP) property. The (DP) property ensures that, given a sufficiently small perturbation of 9 the right-hand-side vector, there exists a dual solution that correctly “prices” the perturbation by 10 computing the exact change in the optimal objective function value. These properties may fail in 11 semi-inf...

متن کامل

Strong duality and sensitivity analysis in semi-infinite linear programming

Finite-dimensional linear programs satisfy strong duality (SD) and have the “dual 8 pricing” (DP) property. The (DP) property ensures that, given a sufficiently small perturbation of 9 the right-hand-side vector, there exists a dual solution that correctly “prices” the perturbation by 10 computing the exact change in the optimal objective function value. These properties may fail in 11 semi-inf...

متن کامل

Feature Selection Using Multi Objective Genetic Algorithm with Support Vector Machine

Different approaches have been proposed for feature selection to obtain suitable features subset among all features. These methods search feature space for feature subsets which satisfies some criteria or optimizes several objective functions. The objective functions are divided into two main groups: filter and wrapper methods.  In filter methods, features subsets are selected due to some measu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1512.06065  شماره 

صفحات  -

تاریخ انتشار 2015